- reducibilities
- rɪ'duËsÉ™'bɪlÉ™tɪ /-'dju- n. ability to be decreased, diminishableness; ability to be expressed in a simpler form
English contemporary dictionary. 2014.
English contemporary dictionary. 2014.
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
Albert Muchnik — Albert Abramovich Muchnik (1934–) is a Russian mathematician who worked in the field of foundations and mathematical logic. He received his Ph.D from Moscow State Pedagogical Institute in 1959 under the advisorship of Pyotr Novikov.[1] Muchnik s… … Wikipedia